منابع مشابه
Completely Connected Clustered Graphs
Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the property that not only every cluster but also each complement of a cluster induces a connected subgraph. As a main result, we prove that a completely connected clustered graph is c-planar if and only if the underlying graph is p...
متن کاملl 1 - Rigid Graphs
An l 1-graph is a graph whose nodes can be labeled by binary vectors in such a way that the Hamming distance between the binary addresses is, up to scale, the distance in the graph between the corresponding nodes. We show that many interesting graphs are l 1-rigid, i.e., that they admit an essentially unique such binary labeling.
متن کاملCompletely Transitive Codes in Hamming Graphs
A code in a graph 0 is a non-empty subset C of the vertex set V of 0. Given C , the partition of V according to the distance of the vertices away from C is called the distance partition of C . A completely regular code is a code whose distance partition has a certain regularity property. A special class of completely regular codes are the completely transitive codes. These are completely regula...
متن کاملGeometric Sensitivity of Rigid Graphs
Let (G, p) be an infinitesimally rigid d-dimensional bar-and-joint framework and let L be an equilibrium load on p. The load can be resolved by appropriate stresses wi,j , ij ∈ E(G), in the bars of the framework. Our goal is to identify the following parts (zones) of the framework: (i) when the location of an unloaded joint v is slightly perturbed, and the same load is applied, the stress will ...
متن کاملEnumerating Planar Minimally Rigid Graphs
We present an algorithm for enumerating without repetitions all the planar (noncrossing) minimally rigid (Laman) graphs embedded on a given generic set of n points. Our algorithm is based on the Reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n) time and O(n) space, or, with a slightly different implementation, in O(n) time and O(n) space. In particular, we obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1974
ISSN: 0004-9735
DOI: 10.1017/s1446788700022904